Distributed Adaption of Dining Philosophers
نویسندگان
چکیده
Adaptation of a component-based system can be achieved in the coordination modelling language Paradigm through the special component McPal. McPal regulates the propagation of new behaviour and guides the changes in the components and in their coordination. Here we show how McPal may delegate part of its control to local adaptation managers, created on-the-fly, allowing for distribution of the adaptation indeed. We illustrate the approach for the well-known example of the dining philosophers problem, by modelling the migration from a deadlock-prone solution to a deadlock-free starvation-free solution without any system quiescence. The adaptation goes through various stages, exhibiting shifting control among McPal and its helpers, and changing degrees of orchestrated and choreographic collaboration.
منابع مشابه
A Distributed Algorithm in Agda: the Dining Philosophers Problem
One distributed algorithm for the dining philosophers problem 1] is implemented in Agda, a proof checker based on Martin-LL of's type theory. The correctness proof of the algorithm is outlined and the diiculties are discussed.
متن کاملAlgorithms for Dynamic Channel Assignment
The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.
متن کاملThe Drinking Philosophers Problem: Resource Allocation in Distributed Systems Seminar paper on Distributed Programming
In 1971 E. W. Dijkstra published the dining philosophers problem, which, since then, has become representative for resource allocation problems in concurrent and distributed programming. In this seminar paper, a generalization called the drinking philosophers problem by Chandy and Misra is surveyed. Since the problems has practical relevance, it has drawn a lot of attention and many different s...
متن کاملQuantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and nondeterminism interact, a situation common to probabilistic distributed algorithms. We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of compon...
متن کاملQuantitative Program Logic and Eeciency in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic 13] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and nondeterminism interact, a situation common to probabilistic distributed algorithms. We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of compone...
متن کامل